<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Navo Portable Library: navo/algorithm/nonlinear/binary/avllnk.c源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- 制作者 Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Navo Portable Library&#160;<span id="projectnumber">Ver 1.0.20120827</span></div>
   <div id="projectbrief">Provides generic platform independent facilities.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="annotated.html"><span>数据结构</span></a></li>
      <li class="current"><a href="files.html"><span>文件</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>文件列表</span></a></li>
      <li><a href="globals.html"><span>全局定义</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<h1>navo/algorithm/nonlinear/binary/avllnk.c</h1>  </div>
</div>
<div class="contents">
<a href="avllnk_8c.html">浏览该文件的文档。</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */</span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &quot;<a class="code" href="avllnk_8h.html" title="AVL linked tree.">avllnk.h</a>&quot;</span>
<a name="l00012"></a>00012 
<a name="l00013"></a>00013 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#pragma optimize(&quot;t&quot;, on)</span>
<a name="l00015"></a>00015 <span class="preprocessor"></span><span class="preprocessor">#endif  </span><span class="comment">/* #ifdef _MSC_VER */</span>
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00018"></a>00018 <span class="preprocessor"></span><span class="keyword">extern</span> <span class="stringliteral">&quot;C&quot;</span> {
<a name="l00019"></a>00019 <span class="preprocessor">#endif </span><span class="comment">/* #ifdef __cplusplus */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="keyword">static</span> <span class="keyword">inline</span> avllnk_link_left(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> child)
<a name="l00022"></a>00022 {
<a name="l00023"></a>00023     parent-&gt;left = child;
<a name="l00024"></a>00024     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga546ae7404c5213a86aa721036babceff" title="仅在node不为空时，设置node的父节点">avllnk_set_parent_if</a>(child, parent);
<a name="l00025"></a>00025 }
<a name="l00026"></a>00026 
<a name="l00027"></a>00027 <span class="keyword">static</span> <span class="keyword">inline</span> avllnk_link_right(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> child)
<a name="l00028"></a>00028 {
<a name="l00029"></a>00029     parent-&gt;right = child;
<a name="l00030"></a>00030     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga546ae7404c5213a86aa721036babceff" title="仅在node不为空时，设置node的父节点">avllnk_set_parent_if</a>(child, parent);
<a name="l00031"></a>00031 }
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">static</span> <span class="keyword">inline</span> avllnk_link_left_unsafe(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> child)
<a name="l00034"></a>00034 {
<a name="l00035"></a>00035     parent-&gt;left = child;
<a name="l00036"></a>00036     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(child, parent);
<a name="l00037"></a>00037 }
<a name="l00038"></a>00038 
<a name="l00039"></a>00039 <span class="keyword">static</span> <span class="keyword">inline</span> avllnk_link_right_unsafe(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> child)
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041     parent-&gt;right = child;
<a name="l00042"></a>00042     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(child, parent);
<a name="l00043"></a>00043 }
<a name="l00044"></a>00044 
<a name="l00045"></a>00045 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> avllnk_replace_child(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> me, 
<a name="l00046"></a>00046                             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> old_child, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> new_child)
<a name="l00047"></a>00047 {
<a name="l00048"></a>00048     <span class="keywordflow">if</span> (me) {
<a name="l00049"></a>00049         <span class="keywordflow">if</span> (old_child == me-&gt;left)
<a name="l00050"></a>00050             me-&gt;left = new_child;
<a name="l00051"></a>00051         <span class="keywordflow">else</span>
<a name="l00052"></a>00052             me-&gt;right = new_child;
<a name="l00053"></a>00053     } <span class="keywordflow">else</span>
<a name="l00054"></a>00054         root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a> = new_child;
<a name="l00055"></a>00055 }
<a name="l00056"></a>00056 
<a name="l00057"></a>00057 <span class="comment">/* 对top节点进行左旋转 */</span>
<a name="l00058"></a>00058 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> avllnk_rotate_left(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00059"></a>00059 {
<a name="l00060"></a>00060     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00061"></a>00061     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node = top-&gt;right;
<a name="l00062"></a>00062     avllnk_link_right(top, node-&gt;left);
<a name="l00063"></a>00063     avllnk_link_left_unsafe(node, top);
<a name="l00064"></a>00064     avllnk_replace_child(root, parent, top, node);
<a name="l00065"></a>00065     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(node, parent);
<a name="l00066"></a>00066     <span class="comment">/* top和node必然是平衡的 */</span>
<a name="l00067"></a>00067     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(node);
<a name="l00068"></a>00068     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070 
<a name="l00071"></a>00071 <span class="comment">/* 对top节点进行右旋转 */</span>
<a name="l00072"></a>00072 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> avllnk_rotate_right(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00075"></a>00075     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node = top-&gt;left;
<a name="l00076"></a>00076     avllnk_link_left(top, node-&gt;right);
<a name="l00077"></a>00077     avllnk_link_right_unsafe(node, top);
<a name="l00078"></a>00078     avllnk_replace_child(root, parent, top, node);
<a name="l00079"></a>00079     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(node, parent);
<a name="l00080"></a>00080     <span class="comment">/* top和node必然是平衡的 */</span>
<a name="l00081"></a>00081     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(node);
<a name="l00082"></a>00082     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084 
<a name="l00085"></a>00085 <span class="comment">/* 对top节点进行左双旋转 */</span>
<a name="l00086"></a>00086 <span class="keyword">static</span> <span class="keywordtype">void</span> avllnk_double_rotate_left(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00087"></a>00087 {
<a name="l00088"></a>00088     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00089"></a>00089     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* first = top-&gt;right;
<a name="l00090"></a>00090     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* second = first-&gt;left;
<a name="l00091"></a>00091     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* third = second-&gt;right;
<a name="l00092"></a>00092     uintptr_t height = <a class="code" href="group__AVL_xE6_xA0_x91.html#gaa8353ffe957c498dc63929ed50ee4cf5" title="得到节点的高度值">avllnk_height</a>(second);
<a name="l00093"></a>00093 
<a name="l00094"></a>00094     avllnk_link_left(first, third);
<a name="l00095"></a>00095     avllnk_link_right(top, second-&gt;left);
<a name="l00096"></a>00096 
<a name="l00097"></a>00097     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(top, second);
<a name="l00098"></a>00098     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(first, second);
<a name="l00099"></a>00099     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(second, parent);
<a name="l00100"></a>00100 
<a name="l00101"></a>00101     second-&gt;left = top;
<a name="l00102"></a>00102     second-&gt;right = first;
<a name="l00103"></a>00103 
<a name="l00104"></a>00104     avllnk_replace_child(root, parent, top, second);
<a name="l00105"></a>00105 
<a name="l00106"></a>00106     <span class="keywordflow">if</span> (AVLLNK_LH == height) {
<a name="l00107"></a>00107         <span class="comment">/* 此时的情况如下，旋转后，second是平衡的，</span>
<a name="l00108"></a>00108 <span class="comment">         * top是平衡的，first不平衡</span>
<a name="l00109"></a>00109 <span class="comment">         *       (top)                     (second)</span>
<a name="l00110"></a>00110 <span class="comment">         *       /   \                     /     \</span>
<a name="l00111"></a>00111 <span class="comment">         *    (c1)  (first)     ===&gt;   (top)     (first)</span>
<a name="l00112"></a>00112 <span class="comment">         *           /    \            /   \          \</span>
<a name="l00113"></a>00113 <span class="comment">         *       (second) (c4)      (c1)   (c2)       (c4)</span>
<a name="l00114"></a>00114 <span class="comment">         *        /</span>
<a name="l00115"></a>00115 <span class="comment">         *      (c2)</span>
<a name="l00116"></a>00116 <span class="comment">         */</span>
<a name="l00117"></a>00117         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00118"></a>00118         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(first);
<a name="l00119"></a>00119     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (AVLLNK_RH == height) {
<a name="l00120"></a>00120         <span class="comment">/* 此时的情况如下，旋转后，second是平衡的，</span>
<a name="l00121"></a>00121 <span class="comment">         * first是平衡的，top不平衡</span>
<a name="l00122"></a>00122 <span class="comment">         *       (top)                     (second)</span>
<a name="l00123"></a>00123 <span class="comment">         *       /   \                     /     \</span>
<a name="l00124"></a>00124 <span class="comment">         *    (c1)  (first)     ===&gt;   (top)     (first)</span>
<a name="l00125"></a>00125 <span class="comment">         *           /    \            /         /   \</span>
<a name="l00126"></a>00126 <span class="comment">         *       (second) (c4)      (c1)       c3)   (c4)</span>
<a name="l00127"></a>00127 <span class="comment">         *             \</span>
<a name="l00128"></a>00128 <span class="comment">         *            (c3)</span>
<a name="l00129"></a>00129 <span class="comment">         */</span>
<a name="l00130"></a>00130         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(first);
<a name="l00131"></a>00131         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(top);
<a name="l00132"></a>00132     } <span class="keywordflow">else</span> {
<a name="l00133"></a>00133         <span class="comment">/* 此时的情况如下，旋转后，top、first和second是平衡的</span>
<a name="l00134"></a>00134 <span class="comment">         *      (top)                  (second)</span>
<a name="l00135"></a>00135 <span class="comment">         *          \                   /    \</span>
<a name="l00136"></a>00136 <span class="comment">         *          (first)  ===&gt;   (top)    (first)</span>
<a name="l00137"></a>00137 <span class="comment">         *          /</span>
<a name="l00138"></a>00138 <span class="comment">         *      (second)</span>
<a name="l00139"></a>00139 <span class="comment">         */</span>
<a name="l00140"></a>00140         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00141"></a>00141         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(first);     
<a name="l00142"></a>00142     }
<a name="l00143"></a>00143 
<a name="l00144"></a>00144     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(second);
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 
<a name="l00147"></a>00147 <span class="keyword">static</span> <span class="keywordtype">void</span> avllnk_double_rotate_right(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00148"></a>00148 {
<a name="l00149"></a>00149     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00150"></a>00150     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* first = top-&gt;left;
<a name="l00151"></a>00151     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* second = first-&gt;right;
<a name="l00152"></a>00152     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* third = second-&gt;left;
<a name="l00153"></a>00153     uintptr_t height = <a class="code" href="group__AVL_xE6_xA0_x91.html#gaa8353ffe957c498dc63929ed50ee4cf5" title="得到节点的高度值">avllnk_height</a>(second);
<a name="l00154"></a>00154 
<a name="l00155"></a>00155     avllnk_link_right(first, third);
<a name="l00156"></a>00156     avllnk_link_left(top, second-&gt;right);
<a name="l00157"></a>00157 
<a name="l00158"></a>00158     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(top, second);
<a name="l00159"></a>00159     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(first, second);
<a name="l00160"></a>00160     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(second, parent);
<a name="l00161"></a>00161 
<a name="l00162"></a>00162     second-&gt;right = top;
<a name="l00163"></a>00163     second-&gt;left = first;
<a name="l00164"></a>00164 
<a name="l00165"></a>00165     avllnk_replace_child(root, parent, top, second);
<a name="l00166"></a>00166     
<a name="l00167"></a>00167     <span class="keywordflow">if</span> (AVLLNK_RH == height) {
<a name="l00168"></a>00168     <span class="comment">/* 此时的情况如下，旋转后，second是平衡的，</span>
<a name="l00169"></a>00169 <span class="comment">         * top是平衡的，first不平衡</span>
<a name="l00170"></a>00170 <span class="comment">         *        (top)                (second)</span>
<a name="l00171"></a>00171 <span class="comment">         *        /   \                 /    \</span>
<a name="l00172"></a>00172 <span class="comment">         *    (first)  (c1)  ===&gt; (first)   (top)</span>
<a name="l00173"></a>00173 <span class="comment">         *     /    \              /        /   \</span>
<a name="l00174"></a>00174 <span class="comment">         *  (c4) (second)       (c4)      (c2)  (c1)</span>
<a name="l00175"></a>00175 <span class="comment">         *              \</span>
<a name="l00176"></a>00176 <span class="comment">         *              (c2)</span>
<a name="l00177"></a>00177 <span class="comment">         */</span>
<a name="l00178"></a>00178         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00179"></a>00179         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(first);
<a name="l00180"></a>00180     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (AVLLNK_LH == height) {
<a name="l00181"></a>00181         <span class="comment">/* 此时的情况如下，旋转后，second是平衡的，</span>
<a name="l00182"></a>00182 <span class="comment">         * top是平衡的，first不平衡</span>
<a name="l00183"></a>00183 <span class="comment">         *        (top)               (second)</span>
<a name="l00184"></a>00184 <span class="comment">         *        /   \                /    \</span>
<a name="l00185"></a>00185 <span class="comment">         *    (first)  (c1) ===&gt;  (first)  (top)</span>
<a name="l00186"></a>00186 <span class="comment">         *     /    \              /   \      \</span>
<a name="l00187"></a>00187 <span class="comment">         *  (c4) (second)       (c4)  (c3)    (c1)</span>
<a name="l00188"></a>00188 <span class="comment">         *         /</span>
<a name="l00189"></a>00189 <span class="comment">         *      (c3)</span>
<a name="l00190"></a>00190 <span class="comment">         */</span>
<a name="l00191"></a>00191         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(first);
<a name="l00192"></a>00192         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(top);
<a name="l00193"></a>00193     } <span class="keywordflow">else</span> {
<a name="l00194"></a>00194         <span class="comment">/* 此时的情况如下，旋转后，top、first和second是平衡的</span>
<a name="l00195"></a>00195 <span class="comment">         *      (top)           (second)</span>
<a name="l00196"></a>00196 <span class="comment">         *       /               /    \</span>
<a name="l00197"></a>00197 <span class="comment">         *  (first)     ===&gt; (first)  (top)</span>
<a name="l00198"></a>00198 <span class="comment">         *       \</span>
<a name="l00199"></a>00199 <span class="comment">         *      (second)</span>
<a name="l00200"></a>00200 <span class="comment">         */</span>
<a name="l00201"></a>00201         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00202"></a>00202         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(first);     
<a name="l00203"></a>00203     }
<a name="l00204"></a>00204 
<a name="l00205"></a>00205     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(second);
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207 
<a name="l00208"></a>00208 <span class="comment">/* 对top节点进行收缩左旋转 */</span>
<a name="l00209"></a>00209 <span class="keyword">static</span> <span class="keywordtype">void</span> avllnk_shrink_rotate_left(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00210"></a>00210 {
<a name="l00211"></a>00211     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00212"></a>00212     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node = top-&gt;right;
<a name="l00213"></a>00213     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* left = node-&gt;left;
<a name="l00214"></a>00214 
<a name="l00215"></a>00215     avllnk_link_right(top, left);
<a name="l00216"></a>00216     avllnk_link_left_unsafe(node, top);
<a name="l00217"></a>00217 
<a name="l00218"></a>00218     avllnk_replace_child(root, parent, top, node);
<a name="l00219"></a>00219 
<a name="l00220"></a>00220     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(node, parent);
<a name="l00221"></a>00221     <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(node)) {
<a name="l00222"></a>00222         <span class="comment">/* 如果node平衡，说明node有c1和c2两个子节点，</span>
<a name="l00223"></a>00223 <span class="comment">         * 旋转后，top和node是不平衡的</span>
<a name="l00224"></a>00224 <span class="comment">         *  (top)                  (node)</span>
<a name="l00225"></a>00225 <span class="comment">         *      \                   /  \</span>
<a name="l00226"></a>00226 <span class="comment">         *      (node)   ====&gt;  (top)  (c1)</span>
<a name="l00227"></a>00227 <span class="comment">         *       /  \               \</span>
<a name="l00228"></a>00228 <span class="comment">         *    (c2)  (c1)            (c2)</span>
<a name="l00229"></a>00229 <span class="comment">         */</span>
<a name="l00230"></a>00230         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(node);
<a name="l00231"></a>00231         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(top);
<a name="l00232"></a>00232     } <span class="keywordflow">else</span> {
<a name="l00233"></a>00233         <span class="comment">/* 如果node不平衡，说明node有且只有c1子节点，</span>
<a name="l00234"></a>00234 <span class="comment">         * 旋转后，top和node是平衡的</span>
<a name="l00235"></a>00235 <span class="comment">         *  (top)                  (node)</span>
<a name="l00236"></a>00236 <span class="comment">         *      \                   /  \</span>
<a name="l00237"></a>00237 <span class="comment">         *      (node)   ====&gt;  (top)  (c1)</span>
<a name="l00238"></a>00238 <span class="comment">         *          \</span>
<a name="l00239"></a>00239 <span class="comment">         *         (c1)</span>
<a name="l00240"></a>00240 <span class="comment">         */</span>
<a name="l00241"></a>00241         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(node);
<a name="l00242"></a>00242         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00243"></a>00243     }
<a name="l00244"></a>00244 }
<a name="l00245"></a>00245 
<a name="l00246"></a>00246 <span class="comment">/* 对top节点进行收缩右旋转 */</span>
<a name="l00247"></a>00247 <span class="keyword">static</span> <span class="keywordtype">void</span> avllnk_shrink_rotate_right(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* top, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00248"></a>00248 {
<a name="l00249"></a>00249     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(top);
<a name="l00250"></a>00250     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node = top-&gt;left;
<a name="l00251"></a>00251     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* right = node-&gt;right;
<a name="l00252"></a>00252 
<a name="l00253"></a>00253     avllnk_link_left(top, right);
<a name="l00254"></a>00254     avllnk_link_right_unsafe(node, top);
<a name="l00255"></a>00255 
<a name="l00256"></a>00256     avllnk_replace_child(root, parent, top, node);
<a name="l00257"></a>00257     
<a name="l00258"></a>00258     <a class="code" href="group__AVL_xE6_xA0_x91.html#gafb7ce3c4fbef8c022feae53e69f2e4ec" title="设置当前节点的父节点">avllnk_set_parent</a>(node, parent);
<a name="l00259"></a>00259     <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(node)) {
<a name="l00260"></a>00260     <span class="comment">/* 如果node平衡，说明node有c1和c2两个子节点，</span>
<a name="l00261"></a>00261 <span class="comment">    * 旋转后，top和node是不平衡的</span>
<a name="l00262"></a>00262 <span class="comment">         *      (top)          (node)</span>
<a name="l00263"></a>00263 <span class="comment">         *      /               /  \</span>
<a name="l00264"></a>00264 <span class="comment">         *   (node)   ====&gt;  (c1)  (top)</span>
<a name="l00265"></a>00265 <span class="comment">         *    /  \                 /</span>
<a name="l00266"></a>00266 <span class="comment">         * (c1)  (c2)            (c2)</span>
<a name="l00267"></a>00267 <span class="comment">         */</span>
<a name="l00268"></a>00268         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(node);
<a name="l00269"></a>00269         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(top);
<a name="l00270"></a>00270     } <span class="keywordflow">else</span> {
<a name="l00271"></a>00271         <span class="comment">/* 如果node不平衡，说明node有且只有c1子节点，</span>
<a name="l00272"></a>00272 <span class="comment">         * 旋转后，top和node是平衡的</span>
<a name="l00273"></a>00273 <span class="comment">         *      (top)          (node)</span>
<a name="l00274"></a>00274 <span class="comment">         *      /               /  \</span>
<a name="l00275"></a>00275 <span class="comment">         *    (node)  ====&gt;  (c1)  (top)</span>
<a name="l00276"></a>00276 <span class="comment">         *    /</span>
<a name="l00277"></a>00277 <span class="comment">         * (c1)</span>
<a name="l00278"></a>00278 <span class="comment">         */</span>
<a name="l00279"></a>00279         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(node);
<a name="l00280"></a>00280         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(top);
<a name="l00281"></a>00281     }
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283 
<a name="l00284"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga8d0cac80915509c752cfceebce741037">00284</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga8d0cac80915509c752cfceebce741037" title="插入节点后，对树进行再平衡调整">avllnk_rebalance</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node, 
<a name="l00285"></a>00285                                 <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent)
<a name="l00286"></a>00286 {
<a name="l00287"></a>00287     <span class="keywordtype">int</span> sdir = AVLLNK_LH;
<a name="l00288"></a>00288 
<a name="l00289"></a>00289     <span class="keywordflow">while</span> (parent) {
<a name="l00290"></a>00290         <span class="keywordflow">if</span> (node == parent-&gt;left) {
<a name="l00291"></a>00291             <span class="keywordflow">if</span> (!<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(parent)) {
<a name="l00292"></a>00292                 <span class="comment">/* 在不平衡节点路径上插入 */</span>
<a name="l00293"></a>00293                 <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga8ee3f2da09ef4b7d1c00610b3372a01f" title="判断节点是否是左子树高">avllnk_left_high</a>(parent)) {
<a name="l00294"></a>00294                     <span class="comment">/* 在长路径上插入，需要进行旋转 */</span>
<a name="l00295"></a>00295                     <span class="keywordflow">if</span> (sdir != AVLLNK_LH &amp;&amp; node-&gt;right)
<a name="l00296"></a>00296                         avllnk_double_rotate_right(parent, root);
<a name="l00297"></a>00297                     <span class="keywordflow">else</span>
<a name="l00298"></a>00298                         avllnk_rotate_right(parent, root);
<a name="l00299"></a>00299                     <span class="keywordflow">break</span>;
<a name="l00300"></a>00300                 } <span class="keywordflow">else</span> {
<a name="l00301"></a>00301                     <span class="comment">/* 在短路径上插入，将parent设为平衡即可 */</span>
<a name="l00302"></a>00302                     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(parent);
<a name="l00303"></a>00303                     <span class="keywordflow">break</span>;
<a name="l00304"></a>00304                 }
<a name="l00305"></a>00305             } <span class="keywordflow">else</span> {
<a name="l00306"></a>00306                 <span class="comment">/* 在平衡节点路径上插入，修改parent的高度值 */</span>
<a name="l00307"></a>00307                 <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(parent);
<a name="l00308"></a>00308             }
<a name="l00309"></a>00309             sdir = AVLLNK_LH;
<a name="l00310"></a>00310         } <span class="keywordflow">else</span> {
<a name="l00311"></a>00311             <span class="keywordflow">if</span> (!<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(parent)) {
<a name="l00312"></a>00312                 <span class="comment">/* 在不平衡节点路径上插入 */</span>
<a name="l00313"></a>00313                 <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga04edcfd65b742a3382b3a51eef68f307" title="判断节点是否是右子树高">avllnk_right_high</a>(parent)) {
<a name="l00314"></a>00314                     <span class="comment">/* 在长路径上插入，需要进行旋转 */</span>
<a name="l00315"></a>00315                     <span class="keywordflow">if</span> (sdir != AVLLNK_RH &amp;&amp; node-&gt;left)
<a name="l00316"></a>00316                         avllnk_double_rotate_left(parent, root);
<a name="l00317"></a>00317                     <span class="keywordflow">else</span>
<a name="l00318"></a>00318                         avllnk_rotate_left(parent, root);
<a name="l00319"></a>00319                     <span class="keywordflow">break</span>;
<a name="l00320"></a>00320                 } <span class="keywordflow">else</span> {
<a name="l00321"></a>00321                     <span class="comment">/* 在短路径上插入，将parent设为平衡即可 */</span>
<a name="l00322"></a>00322                     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(parent);
<a name="l00323"></a>00323                     <span class="keywordflow">break</span>;
<a name="l00324"></a>00324                 }
<a name="l00325"></a>00325             } <span class="keywordflow">else</span> {
<a name="l00326"></a>00326                 <span class="comment">/* 在平衡节点路径上插入，修改parent的高度值 */</span>
<a name="l00327"></a>00327                 <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(parent);
<a name="l00328"></a>00328             }
<a name="l00329"></a>00329             sdir = AVLLNK_RH;
<a name="l00330"></a>00330         }
<a name="l00331"></a>00331         node = parent;
<a name="l00332"></a>00332         parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(node);
<a name="l00333"></a>00333     }
<a name="l00334"></a>00334 }
<a name="l00335"></a>00335 
<a name="l00336"></a>00336 <span class="comment">/* 删除时平衡化 */</span>
<a name="l00337"></a>00337 <span class="keyword">static</span> <span class="keywordtype">void</span> __avllnk_rebalance_on_erase(<a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node, 
<a name="l00338"></a>00338                     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent, <a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <span class="keywordtype">int</span> which)
<a name="l00339"></a>00339 {
<a name="l00340"></a>00340     <span class="keywordflow">if</span> (parent) {
<a name="l00341"></a>00341         <span class="keywordflow">if</span> (!node) {
<a name="l00342"></a>00342             <span class="comment">/* node为空，且parent左右子均为空 */</span>
<a name="l00343"></a>00343             <span class="keywordflow">if</span> (which == AVLLNK_LH)
<a name="l00344"></a>00344                 <span class="keywordflow">goto</span> __AVLLNK_REBALANCE_ON_ERASE_LT;
<a name="l00345"></a>00345             <span class="keywordflow">else</span>
<a name="l00346"></a>00346                 <span class="keywordflow">goto</span> __AVLLNK_REBALANCE_ON_ERASE_RT;
<a name="l00347"></a>00347         } <span class="keywordflow">do</span> {
<a name="l00348"></a>00348             <span class="keywordflow">if</span> (node == parent-&gt;left) {
<a name="l00349"></a>00349 __AVLLNK_REBALANCE_ON_ERASE_LT:
<a name="l00350"></a>00350                 <span class="keywordflow">if</span> (!<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(parent)) {
<a name="l00351"></a>00351                     <span class="comment">/* 在不平衡节点路径上删除 */</span>
<a name="l00352"></a>00352                     <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga8ee3f2da09ef4b7d1c00610b3372a01f" title="判断节点是否是左子树高">avllnk_left_high</a>(parent)) {
<a name="l00353"></a>00353                         <span class="comment">/* 在长路径上删除，将parent设为平衡即可 */</span>
<a name="l00354"></a>00354                         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(parent);
<a name="l00355"></a>00355                     } <span class="keywordflow">else</span> {
<a name="l00356"></a>00356                         <span class="comment">/* 在短路径上删除，需要进行旋转 */</span>
<a name="l00357"></a>00357                         <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga8ee3f2da09ef4b7d1c00610b3372a01f" title="判断节点是否是左子树高">avllnk_left_high</a>(parent-&gt;right))
<a name="l00358"></a>00358                             avllnk_double_rotate_left(parent, root);
<a name="l00359"></a>00359                         <span class="keywordflow">else</span>
<a name="l00360"></a>00360                             avllnk_shrink_rotate_left(parent, root);
<a name="l00361"></a>00361                         <span class="keywordflow">break</span>;
<a name="l00362"></a>00362                     }
<a name="l00363"></a>00363                 } <span class="keywordflow">else</span> {
<a name="l00364"></a>00364                     <span class="comment">/* 在平衡节点路径上删除，修改parent的高度值 */</span>
<a name="l00365"></a>00365                     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga09a24ae32f166f358df10788e0f7c284" title="设置当前节点高度为右子树高">avllnk_set_right_high</a>(parent);
<a name="l00366"></a>00366                     <span class="keywordflow">break</span>;
<a name="l00367"></a>00367                 }
<a name="l00368"></a>00368                 node = parent;
<a name="l00369"></a>00369                 parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(node);
<a name="l00370"></a>00370             } <span class="keywordflow">else</span> {
<a name="l00371"></a>00371 __AVLLNK_REBALANCE_ON_ERASE_RT:
<a name="l00372"></a>00372                 <span class="keywordflow">if</span> (!<a class="code" href="group__AVL_xE6_xA0_x91.html#ga364ee370c34025c9318833ee20965759" title="判断节点是否是平衡的">avllnk_balanced</a>(parent)) {
<a name="l00373"></a>00373                     <span class="comment">/* 在不平衡节点路径上删除 */</span>
<a name="l00374"></a>00374                     <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga04edcfd65b742a3382b3a51eef68f307" title="判断节点是否是右子树高">avllnk_right_high</a>(parent)) {
<a name="l00375"></a>00375                         <span class="comment">/* 在长路径上删除，将parent设为平衡即可 */</span>
<a name="l00376"></a>00376                         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7d074b83d26dcadffe3833166a9c048a" title="设置当前节点为平衡节点">avllnk_set_balanced</a>(parent);
<a name="l00377"></a>00377                     } <span class="keywordflow">else</span> {
<a name="l00378"></a>00378                         <span class="comment">/* 在短路径上删除，需要进行旋转 */</span>
<a name="l00379"></a>00379                         <span class="keywordflow">if</span> (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga04edcfd65b742a3382b3a51eef68f307" title="判断节点是否是右子树高">avllnk_right_high</a>(parent-&gt;left))
<a name="l00380"></a>00380                             avllnk_double_rotate_right(parent, root);
<a name="l00381"></a>00381                         <span class="keywordflow">else</span>
<a name="l00382"></a>00382                             avllnk_shrink_rotate_right(parent, root);
<a name="l00383"></a>00383                         <span class="keywordflow">break</span>;
<a name="l00384"></a>00384                     }
<a name="l00385"></a>00385                 } <span class="keywordflow">else</span> {
<a name="l00386"></a>00386                     <span class="comment">/* 在平衡节点路径上删除，修改parent的高度值 */</span>
<a name="l00387"></a>00387                     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga2089ba17ce26c8762a19c614a8d06555" title="设置当前节点高度为左子树高">avllnk_set_left_high</a>(parent);
<a name="l00388"></a>00388                     <span class="keywordflow">break</span>;
<a name="l00389"></a>00389                 }
<a name="l00390"></a>00390                 node = parent;
<a name="l00391"></a>00391                 parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(node);
<a name="l00392"></a>00392             }
<a name="l00393"></a>00393         } <span class="keywordflow">while</span> (parent);
<a name="l00394"></a>00394     }
<a name="l00395"></a>00395 }
<a name="l00396"></a>00396 
<a name="l00397"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#gaf66cbfca9147bf2de3109b0792242c6b">00397</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#gaf66cbfca9147bf2de3109b0792242c6b" title="移除某个节点">avllnk_erase</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* entry)
<a name="l00398"></a>00398 {
<a name="l00399"></a>00399     <span class="keywordtype">int</span> which;
<a name="l00400"></a>00400     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* child;
<a name="l00401"></a>00401     <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(entry);
<a name="l00402"></a>00402 
<a name="l00403"></a>00403     <span class="keywordflow">do</span> {<span class="comment">/* 如果entry节点最多只有一个孩子，则直接删除entry节点</span>
<a name="l00404"></a>00404 <span class="comment">         * 并调整树，如果entry同时有两个孩子，需要将其转换成</span>
<a name="l00405"></a>00405 <span class="comment">         * 只有一子或无子的情况</span>
<a name="l00406"></a>00406 <span class="comment">         */</span>
<a name="l00407"></a>00407         <span class="keywordflow">if</span> (!entry-&gt;left) {
<a name="l00408"></a>00408             child = entry-&gt;right;
<a name="l00409"></a>00409         } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!entry-&gt;right) {
<a name="l00410"></a>00410             child = entry-&gt;left;
<a name="l00411"></a>00411         } <span class="keywordflow">else</span> {
<a name="l00412"></a>00412             <a class="code" href="group__AVL_xE6_xA0_x91.html#gada1586d3a852e7d13f51543c09ac5a58" title="节点">avllnk_node</a>* node = entry-&gt;right;
<a name="l00413"></a>00413             <span class="comment">/* 找到最靠近entry节点右边的节点来交换，</span>
<a name="l00414"></a>00414 <span class="comment">             * 方法是先找右节点，再循环向左找到最左</span>
<a name="l00415"></a>00415 <span class="comment">             * 端的node节点，将该节点替换到entry节</span>
<a name="l00416"></a>00416 <span class="comment">             * 点的位置，此时树性质不受影响，问题转</span>
<a name="l00417"></a>00417 <span class="comment">             * 变成了删除找到的node节点的问题</span>
<a name="l00418"></a>00418 <span class="comment">             */</span>
<a name="l00419"></a>00419             <span class="keywordflow">while</span> (node-&gt;left)
<a name="l00420"></a>00420                 node = node-&gt;left;
<a name="l00421"></a>00421             <span class="comment">/* 将node节点设为entry父节点的孩子 */</span>
<a name="l00422"></a>00422             which = (entry == parent-&gt;right);
<a name="l00423"></a>00423             avllnk_replace_child(root, parent, entry, node);
<a name="l00424"></a>00424             <span class="comment">/* 记录node节点原来的节点信息，用于树的调整 */</span>
<a name="l00425"></a>00425             child = node-&gt;right;
<a name="l00426"></a>00426             parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(node);
<a name="l00427"></a>00427             <span class="keywordflow">if</span> (parent == entry) {
<a name="l00428"></a>00428                 <span class="comment">/* 说明找到的node节点是entry的右子 */</span>
<a name="l00429"></a>00429                 parent = node;
<a name="l00430"></a>00430             } <span class="keywordflow">else</span> {
<a name="l00431"></a>00431                 <span class="comment">/* 替换entry节点到node节点，相当</span>
<a name="l00432"></a>00432 <span class="comment">                 * 于删除了原来node位置的节点</span>
<a name="l00433"></a>00433 <span class="comment">                 */</span>
<a name="l00434"></a>00434                 <a class="code" href="group__AVL_xE6_xA0_x91.html#ga546ae7404c5213a86aa721036babceff" title="仅在node不为空时，设置node的父节点">avllnk_set_parent_if</a>(child, parent);
<a name="l00435"></a>00435                 parent-&gt;left = child;
<a name="l00436"></a>00436                 avllnk_link_right_unsafe(node, entry-&gt;right);
<a name="l00437"></a>00437             }
<a name="l00438"></a>00438 
<a name="l00439"></a>00439             node-&gt;parent_height = entry-&gt;parent_height;
<a name="l00440"></a>00440             avllnk_link_left_unsafe(node, entry-&gt;left);
<a name="l00441"></a>00441 
<a name="l00442"></a>00442             <span class="comment">/* 平衡树 */</span>
<a name="l00443"></a>00443             <span class="keywordflow">break</span>;
<a name="l00444"></a>00444         }
<a name="l00445"></a>00445         <span class="comment">/* 接上面的if和else if，删除entry节点 */</span>
<a name="l00446"></a>00446         which = (entry == parent-&gt;right);
<a name="l00447"></a>00447         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga546ae7404c5213a86aa721036babceff" title="仅在node不为空时，设置node的父节点">avllnk_set_parent_if</a>(child, parent);
<a name="l00448"></a>00448         avllnk_replace_child(root, parent, entry, child);
<a name="l00449"></a>00449     } <span class="keywordflow">while</span> (0);
<a name="l00450"></a>00450 
<a name="l00451"></a>00451     <span class="comment">/* 平衡树 */</span>
<a name="l00452"></a>00452     __avllnk_rebalance_on_erase(child, parent, root, which);
<a name="l00453"></a>00453 }
<a name="l00454"></a>00454 
<a name="l00455"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga062945f5da72bea1f96c1e79b14ee1d6">00455</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga062945f5da72bea1f96c1e79b14ee1d6" title="移除区域内的节点">avllnk_erases</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> begin, 
<a name="l00456"></a>00456                         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> end, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga6d7aaed44e837466148513a1e9c4b055" title="单参数回调函数指针">avllnk_pr1</a> erase_handler)
<a name="l00457"></a>00457 {
<a name="l00458"></a>00458     <span class="keywordflow">if</span> (erase_handler) {
<a name="l00459"></a>00459         <span class="keywordflow">while</span> (begin != end) {
<a name="l00460"></a>00460             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur = begin;
<a name="l00461"></a>00461             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(begin);
<a name="l00462"></a>00462             <a class="code" href="group__AVL_xE6_xA0_x91.html#gaf66cbfca9147bf2de3109b0792242c6b" title="移除某个节点">avllnk_erase</a>(root, cur);
<a name="l00463"></a>00463             erase_handler(cur);
<a name="l00464"></a>00464         }
<a name="l00465"></a>00465 
<a name="l00466"></a>00466     } <span class="keywordflow">else</span> {
<a name="l00467"></a>00467         <span class="keywordflow">while</span> (begin != end)
<a name="l00468"></a>00468             <a class="code" href="group__AVL_xE6_xA0_x91.html#gaf66cbfca9147bf2de3109b0792242c6b" title="移除某个节点">avllnk_erase</a>(root, <a class="code" href="group__AVL_xE6_xA0_x91.html#gaa5d4560ed66c6bce1884a391b0cef501" title="迭代器后自增">avllnk_inc_later</a>(begin));
<a name="l00469"></a>00469     }
<a name="l00470"></a>00470 }
<a name="l00471"></a>00471 
<a name="l00472"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga3f0b2fc1c3ebdcafb623a3906b168ad3">00472</a> NV_IMPL <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga3f0b2fc1c3ebdcafb623a3906b168ad3" title="给迭代器增加一段距离或减小一段距离">avllnk_advance</a>(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur, <span class="keywordtype">int</span> dist)
<a name="l00473"></a>00473 {
<a name="l00474"></a>00474     <span class="keywordflow">if</span> (dist &gt; 0) {
<a name="l00475"></a>00475         <span class="keywordflow">while</span> (cur &amp;&amp; dist--)
<a name="l00476"></a>00476             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(cur);
<a name="l00477"></a>00477     } <span class="keywordflow">else</span> {
<a name="l00478"></a>00478         <span class="keywordflow">while</span> (cur &amp;&amp; dist++)
<a name="l00479"></a>00479             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga16e3c0d56368448f31d026003b3c8f74" title="迭代器递减">avllnk_dec</a>(cur);
<a name="l00480"></a>00480     }
<a name="l00481"></a>00481     <span class="keywordflow">return</span> cur;
<a name="l00482"></a>00482 }
<a name="l00483"></a>00483 
<a name="l00484"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga704200059c0476fc18782999861d6a14">00484</a> NV_IMPL <span class="keywordtype">int</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga704200059c0476fc18782999861d6a14" title="判断一个节点是否存在于树中">avllnk_exist</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> itr)
<a name="l00485"></a>00485 {
<a name="l00486"></a>00486     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga0db4502b30c43020bbb5fe927c7f9d0a" title="得到树的最左端节点">avllnk_front</a>(root);
<a name="l00487"></a>00487     
<a name="l00488"></a>00488     <span class="keywordflow">while</span> (i) {
<a name="l00489"></a>00489         <span class="keywordflow">if</span> (i == itr)
<a name="l00490"></a>00490             <span class="keywordflow">return</span> 1;
<a name="l00491"></a>00491         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(i);
<a name="l00492"></a>00492     }
<a name="l00493"></a>00493     
<a name="l00494"></a>00494     <span class="keywordflow">return</span> 0;
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496 
<a name="l00497"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga0db4502b30c43020bbb5fe927c7f9d0a">00497</a> NV_IMPL <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga0db4502b30c43020bbb5fe927c7f9d0a" title="得到树的最左端节点">avllnk_front</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00498"></a>00498 {
<a name="l00499"></a>00499     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a>;
<a name="l00500"></a>00500 
<a name="l00501"></a>00501     <span class="keywordflow">if</span> (!i)
<a name="l00502"></a>00502         <span class="keywordflow">return</span> NULL;
<a name="l00503"></a>00503 
<a name="l00504"></a>00504     <span class="comment">/* 一直往左边走，找到最左边的节点 */</span>
<a name="l00505"></a>00505     <span class="keywordflow">while</span> (i-&gt;left)
<a name="l00506"></a>00506         i = i-&gt;left;
<a name="l00507"></a>00507 
<a name="l00508"></a>00508     <span class="keywordflow">return</span> i;
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510 
<a name="l00511"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga1634f51b55974ba696e962491ebc4eed">00511</a> NV_IMPL <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga1634f51b55974ba696e962491ebc4eed" title="得到树的最右端节点">avllnk_back</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00512"></a>00512 {
<a name="l00513"></a>00513     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a>;
<a name="l00514"></a>00514     
<a name="l00515"></a>00515     <span class="keywordflow">if</span> (!i)
<a name="l00516"></a>00516         <span class="keywordflow">return</span> NULL;
<a name="l00517"></a>00517     
<a name="l00518"></a>00518     <span class="comment">/* 一直往右边走，找到最右边的节点 */</span>
<a name="l00519"></a>00519     <span class="keywordflow">while</span> (i-&gt;right)
<a name="l00520"></a>00520         i = i-&gt;right;
<a name="l00521"></a>00521     
<a name="l00522"></a>00522     <span class="keywordflow">return</span> i;
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524 
<a name="l00525"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#gab06d7fe0465e53f4d47490bcdc59ccf4">00525</a> NV_IMPL <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> <a class="code" href="group__AVL_xE6_xA0_x91.html#gab06d7fe0465e53f4d47490bcdc59ccf4" title="得到当前节点的中序后继节点">avllnk_next</a>(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur)
<a name="l00526"></a>00526 {
<a name="l00527"></a>00527     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent;
<a name="l00528"></a>00528     
<a name="l00529"></a>00529     <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00530"></a>00530     <span class="keywordflow">if</span> (cur-&gt;right) {
<a name="l00531"></a>00531         cur = cur-&gt;right;
<a name="l00532"></a>00532         <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00533"></a>00533         <span class="keywordflow">while</span> (cur-&gt;left)
<a name="l00534"></a>00534             cur = cur-&gt;left;
<a name="l00535"></a>00535         <span class="keywordflow">return</span> cur;
<a name="l00536"></a>00536     }
<a name="l00537"></a>00537     <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00538"></a>00538     <span class="keywordflow">while</span> ((parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(cur)) 
<a name="l00539"></a>00539             &amp;&amp; cur == parent-&gt;right)
<a name="l00540"></a>00540         cur = parent;
<a name="l00541"></a>00541     
<a name="l00542"></a>00542     <span class="keywordflow">return</span> parent;
<a name="l00543"></a>00543 }
<a name="l00544"></a>00544 
<a name="l00545"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga7311b77daeb0f3c6b467e57207014ccc">00545</a> NV_IMPL <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga7311b77daeb0f3c6b467e57207014ccc" title="得到当前节点的中序前驱节点">avllnk_prev</a>(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur)
<a name="l00546"></a>00546 {
<a name="l00547"></a>00547     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent;
<a name="l00548"></a>00548 
<a name="l00549"></a>00549     <span class="comment">/* 如果有左孩子，往左边走 */</span>
<a name="l00550"></a>00550     <span class="keywordflow">if</span> (cur-&gt;left) {
<a name="l00551"></a>00551         cur = cur-&gt;left;
<a name="l00552"></a>00552         <span class="comment">/* 找左孩子下最靠右的节点 */</span>
<a name="l00553"></a>00553         <span class="keywordflow">while</span> (cur-&gt;right)
<a name="l00554"></a>00554             cur = cur-&gt;right;
<a name="l00555"></a>00555         <span class="keywordflow">return</span> cur;
<a name="l00556"></a>00556     }
<a name="l00557"></a>00557     <span class="comment">/* 如果没有左孩子，向父节点走 */</span>
<a name="l00558"></a>00558     <span class="keywordflow">while</span> ((parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(cur)) 
<a name="l00559"></a>00559             &amp;&amp; cur == parent-&gt;left)
<a name="l00560"></a>00560         cur = parent;
<a name="l00561"></a>00561 
<a name="l00562"></a>00562     <span class="keywordflow">return</span> parent;
<a name="l00563"></a>00563 }
<a name="l00564"></a>00564 
<a name="l00565"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga584d9cf0d557e45fac9ac792967ecd38">00565</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga584d9cf0d557e45fac9ac792967ecd38" title="计算树的深度">avllnk_depth</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00566"></a>00566 {
<a name="l00567"></a>00567     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00568"></a>00568     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00569"></a>00569     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent;
<a name="l00570"></a>00570     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur = root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a>;
<a name="l00571"></a>00571     
<a name="l00572"></a>00572     <span class="keywordflow">if</span> (cur) {
<a name="l00573"></a>00573         cur_depth = 1;
<a name="l00574"></a>00574         <span class="keywordflow">while</span> (cur-&gt;left) {
<a name="l00575"></a>00575             cur = cur-&gt;left;
<a name="l00576"></a>00576             ++cur_depth;
<a name="l00577"></a>00577         }
<a name="l00578"></a>00578         max_depth = cur_depth;
<a name="l00579"></a>00579         <span class="keywordflow">do</span> {<span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00580"></a>00580             <span class="keywordflow">if</span> (cur-&gt;right) {
<a name="l00581"></a>00581                 cur = cur-&gt;right;
<a name="l00582"></a>00582                 ++cur_depth;
<a name="l00583"></a>00583                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00584"></a>00584                 <span class="keywordflow">while</span> (cur-&gt;left) {
<a name="l00585"></a>00585                     cur = cur-&gt;left;
<a name="l00586"></a>00586                     ++cur_depth;
<a name="l00587"></a>00587                 }
<a name="l00588"></a>00588                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00589"></a>00589                     max_depth = cur_depth;
<a name="l00590"></a>00590             } <span class="keywordflow">else</span> {
<a name="l00591"></a>00591                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00592"></a>00592                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(cur)) 
<a name="l00593"></a>00593                         &amp;&amp; cur == parent-&gt;right) {
<a name="l00594"></a>00594                     cur = parent;
<a name="l00595"></a>00595                     --cur_depth;
<a name="l00596"></a>00596                 }
<a name="l00597"></a>00597                 cur = parent;
<a name="l00598"></a>00598                 --cur_depth;
<a name="l00599"></a>00599             }
<a name="l00600"></a>00600         } <span class="keywordflow">while</span> (cur);
<a name="l00601"></a>00601     }
<a name="l00602"></a>00602     
<a name="l00603"></a>00603     <span class="keywordflow">return</span> max_depth;
<a name="l00604"></a>00604 }
<a name="l00605"></a>00605 
<a name="l00606"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga0bdae474b1779392de944dbe1eee2d0c">00606</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga0bdae474b1779392de944dbe1eee2d0c" title="计算树的叶子数">avllnk_leafs</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00607"></a>00607 {
<a name="l00608"></a>00608     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00609"></a>00609     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent;
<a name="l00610"></a>00610     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga792e1e4f83bba2aad61546629e7ca033" title="得到指向正向起始位置的迭代器">avllnk_begin</a>(root);
<a name="l00611"></a>00611     
<a name="l00612"></a>00612     <span class="keywordflow">while</span> (cur) {
<a name="l00613"></a>00613         <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00614"></a>00614         <span class="keywordflow">if</span> (cur-&gt;right) {
<a name="l00615"></a>00615             cur = cur-&gt;right;
<a name="l00616"></a>00616             <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00617"></a>00617             <span class="keywordflow">while</span> (cur-&gt;left)
<a name="l00618"></a>00618                 cur = cur-&gt;left;
<a name="l00619"></a>00619         } <span class="keywordflow">else</span> {
<a name="l00620"></a>00620             <span class="keywordflow">if</span> (!cur-&gt;left)
<a name="l00621"></a>00621                 ++leafs;
<a name="l00622"></a>00622             <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00623"></a>00623             <span class="keywordflow">while</span> ((parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(cur)) 
<a name="l00624"></a>00624                     &amp;&amp; cur == parent-&gt;right)
<a name="l00625"></a>00625                 cur = parent;
<a name="l00626"></a>00626             cur = parent;
<a name="l00627"></a>00627         }
<a name="l00628"></a>00628     }
<a name="l00629"></a>00629     
<a name="l00630"></a>00630     <span class="keywordflow">return</span> leafs;
<a name="l00631"></a>00631 }
<a name="l00632"></a>00632 
<a name="l00633"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga9edbfa0855053c7f9bbd4d6e8a86199d">00633</a> NV_IMPL <span class="keywordtype">void</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga9edbfa0855053c7f9bbd4d6e8a86199d" title="获取树的信息，包括节点数、深度、叶子数">avllnk_get_info</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="structavllnk__info.html" title="树信息表">avllnk_info</a>* info)
<a name="l00634"></a>00634 {
<a name="l00635"></a>00635     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00636"></a>00636     <span class="keywordtype">size_t</span> leafs = 0;
<a name="l00637"></a>00637     <span class="keywordtype">size_t</span> cur_depth;
<a name="l00638"></a>00638     <span class="keywordtype">size_t</span> max_depth = 0;
<a name="l00639"></a>00639     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> parent;
<a name="l00640"></a>00640     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur = root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a>;
<a name="l00641"></a>00641     
<a name="l00642"></a>00642     <span class="keywordflow">if</span> (cur) {
<a name="l00643"></a>00643         cur_depth = 1;
<a name="l00644"></a>00644         <span class="keywordflow">while</span> (cur-&gt;left) {
<a name="l00645"></a>00645             cur = cur-&gt;left;
<a name="l00646"></a>00646             ++cur_depth;
<a name="l00647"></a>00647         }
<a name="l00648"></a>00648         max_depth = cur_depth;
<a name="l00649"></a>00649         <span class="keywordflow">do</span> {
<a name="l00650"></a>00650             ++cnt;
<a name="l00651"></a>00651             <span class="comment">/* 如果有右孩子，往右边走 */</span>
<a name="l00652"></a>00652             <span class="keywordflow">if</span> (cur-&gt;right) {
<a name="l00653"></a>00653                 cur = cur-&gt;right;
<a name="l00654"></a>00654                 ++cur_depth;
<a name="l00655"></a>00655                 <span class="comment">/* 找右孩子下最靠左的节点 */</span>
<a name="l00656"></a>00656                 <span class="keywordflow">while</span> (cur-&gt;left) {
<a name="l00657"></a>00657                     cur = cur-&gt;left;
<a name="l00658"></a>00658                     ++cur_depth;
<a name="l00659"></a>00659                 }
<a name="l00660"></a>00660                 <span class="keywordflow">if</span> (cur_depth &gt; max_depth)
<a name="l00661"></a>00661                     max_depth = cur_depth;
<a name="l00662"></a>00662             } <span class="keywordflow">else</span> {
<a name="l00663"></a>00663                 <span class="keywordflow">if</span> (!cur-&gt;left)
<a name="l00664"></a>00664                     ++leafs;
<a name="l00665"></a>00665                 <span class="comment">/* 如果没有右孩子，向父节点走 */</span>
<a name="l00666"></a>00666                 <span class="keywordflow">while</span> ((parent = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga691c39005f3bf2afc370f10c4e7d98f1" title="得到父节点">avllnk_parent</a>(cur)) 
<a name="l00667"></a>00667                         &amp;&amp; cur == parent-&gt;right) {
<a name="l00668"></a>00668                     cur = parent;
<a name="l00669"></a>00669                     --cur_depth;
<a name="l00670"></a>00670                 }
<a name="l00671"></a>00671                 cur = parent;
<a name="l00672"></a>00672                 --cur_depth;
<a name="l00673"></a>00673             }
<a name="l00674"></a>00674         } <span class="keywordflow">while</span> (cur);
<a name="l00675"></a>00675     }
<a name="l00676"></a>00676     
<a name="l00677"></a>00677     info-&gt;<a class="code" href="structavllnk__info.html#a76d971a3c552bc58ba9f0d5fceae9806" title="节点数">count</a> = cnt;
<a name="l00678"></a>00678     info-&gt;<a class="code" href="structavllnk__info.html#a820c167ceaaa9759b0ca2695d22db55c" title="深度">depth</a> = max_depth;
<a name="l00679"></a>00679     info-&gt;<a class="code" href="structavllnk__info.html#a62f3b2ad4f6c6147d1bb9a71dd8c9656" title="叶子数">leafs</a> = leafs;
<a name="l00680"></a>00680 }
<a name="l00681"></a>00681 
<a name="l00682"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga05210b7a523aff433666c4b6c7fec4b4">00682</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga05210b7a523aff433666c4b6c7fec4b4" title="获取树的节点总数">avllnk_count</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root)
<a name="l00683"></a>00683 {
<a name="l00684"></a>00684     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00685"></a>00685     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga792e1e4f83bba2aad61546629e7ca033" title="得到指向正向起始位置的迭代器">avllnk_begin</a>(root);
<a name="l00686"></a>00686 
<a name="l00687"></a>00687     <span class="keywordflow">while</span> (i) {
<a name="l00688"></a>00688         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(i);
<a name="l00689"></a>00689         ++cnt;
<a name="l00690"></a>00690     }
<a name="l00691"></a>00691 
<a name="l00692"></a>00692     <span class="keywordflow">return</span> cnt;
<a name="l00693"></a>00693 }
<a name="l00694"></a>00694 
<a name="l00695"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#gaeb29658f08fdd8c607c2f04a2dd9afd5">00695</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#gaeb29658f08fdd8c607c2f04a2dd9afd5" title="计算两个节点的迭代距离">avllnk_distance</a>(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> first, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> last)
<a name="l00696"></a>00696 {
<a name="l00697"></a>00697     <span class="keywordtype">size_t</span> dist = 1;
<a name="l00698"></a>00698     
<a name="l00699"></a>00699     <span class="keywordflow">while</span> (first != last) {
<a name="l00700"></a>00700         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(first);
<a name="l00701"></a>00701         ++dist;
<a name="l00702"></a>00702     }
<a name="l00703"></a>00703     
<a name="l00704"></a>00704     <span class="keywordflow">return</span> dist;
<a name="l00705"></a>00705 }
<a name="l00706"></a>00706 
<a name="l00707"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#gaa2e635167aec956c163f38e293006b06">00707</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#gaa2e635167aec956c163f38e293006b06" title="计算迭代器的正向索引">avllnk_index_of</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> itr)
<a name="l00708"></a>00708 {
<a name="l00709"></a>00709     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00710"></a>00710     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga792e1e4f83bba2aad61546629e7ca033" title="得到指向正向起始位置的迭代器">avllnk_begin</a>(root);
<a name="l00711"></a>00711     
<a name="l00712"></a>00712     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00713"></a>00713         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(i);
<a name="l00714"></a>00714         ++cnt;
<a name="l00715"></a>00715     }
<a name="l00716"></a>00716     
<a name="l00717"></a>00717     <span class="keywordflow">return</span> cnt;
<a name="l00718"></a>00718 }
<a name="l00719"></a>00719 
<a name="l00720"></a><a class="code" href="group__AVL_xE6_xA0_x91.html#ga3a272f8492a0090feeb1bf4552b7535b">00720</a> NV_IMPL <span class="keywordtype">size_t</span> <a class="code" href="group__AVL_xE6_xA0_x91.html#ga3a272f8492a0090feeb1bf4552b7535b" title="计算迭代器的逆向索引">avllnk_reverse_index_of</a>(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> itr)
<a name="l00721"></a>00721 {
<a name="l00722"></a>00722     <span class="keywordtype">size_t</span> cnt = 0;
<a name="l00723"></a>00723     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = <a class="code" href="group__AVL_xE6_xA0_x91.html#gaaedf1042b54f902d06e8c685e0b95385" title="得到指向逆向起始位置的迭代器">avllnk_rbegin</a>(root);
<a name="l00724"></a>00724     
<a name="l00725"></a>00725     <span class="keywordflow">while</span> (i &amp;&amp; i != itr) {
<a name="l00726"></a>00726         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga16e3c0d56368448f31d026003b3c8f74" title="迭代器递减">avllnk_dec</a>(i);
<a name="l00727"></a>00727         ++cnt;
<a name="l00728"></a>00728     }
<a name="l00729"></a>00729     
<a name="l00730"></a>00730     <span class="keywordflow">return</span> cnt;
<a name="l00731"></a>00731 }
<a name="l00732"></a>00732 
<a name="l00733"></a>00733 NV_IMPL <span class="keywordtype">void</span> __do_avllnk_recurse_foreach(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur, 
<a name="l00734"></a>00734                         <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00735"></a>00735 {
<a name="l00736"></a>00736     <span class="keywordflow">if</span> (cur) {
<a name="l00737"></a>00737         __do_avllnk_recurse_foreach(cur-&gt;left, fn, offset);
<a name="l00738"></a>00738         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00739"></a>00739         __do_avllnk_recurse_foreach(cur-&gt;right, fn, offset);
<a name="l00740"></a>00740     }
<a name="l00741"></a>00741 }
<a name="l00742"></a>00742 
<a name="l00743"></a>00743 NV_IMPL <span class="keywordtype">void</span> __do_avllnk_recurse_reverse_foreach(<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> cur, 
<a name="l00744"></a>00744                         <span class="keywordtype">void</span> (*fn)(<span class="keywordtype">void</span>*), <span class="keywordtype">size_t</span> offset)
<a name="l00745"></a>00745 {
<a name="l00746"></a>00746     <span class="keywordflow">if</span> (cur) {
<a name="l00747"></a>00747         __do_avllnk_recurse_reverse_foreach(cur-&gt;right, fn, offset);
<a name="l00748"></a>00748         fn(((<span class="keywordtype">char</span>*)cur) - offset);
<a name="l00749"></a>00749         __do_avllnk_recurse_reverse_foreach(cur-&gt;left, fn, offset);
<a name="l00750"></a>00750     }
<a name="l00751"></a>00751 }
<a name="l00752"></a>00752 
<a name="l00753"></a>00753 NV_IMPL <span class="keywordtype">void</span> __avllnk_serialize(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <span class="keywordtype">void</span>** buf, <span class="keywordtype">size_t</span> offset)
<a name="l00754"></a>00754 {
<a name="l00755"></a>00755     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> i = <a class="code" href="group__AVL_xE6_xA0_x91.html#ga792e1e4f83bba2aad61546629e7ca033" title="得到指向正向起始位置的迭代器">avllnk_begin</a>(root);
<a name="l00756"></a>00756 
<a name="l00757"></a>00757     <span class="keywordflow">while</span> (i) {
<a name="l00758"></a>00758         <span class="keywordtype">void</span>* p = ((<span class="keywordtype">char</span>*)i) - offset;
<a name="l00759"></a>00759         *buf++ = p;
<a name="l00760"></a>00760         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga46ed1ab24644d90c5e70a413f455e670" title="迭代器递增">avllnk_inc</a>(i);
<a name="l00761"></a>00761     }
<a name="l00762"></a>00762 }
<a name="l00763"></a>00763 
<a name="l00764"></a>00764 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> AVLLNK_F(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> resv)
<a name="l00765"></a>00765 {
<a name="l00766"></a>00766     <span class="keywordflow">if</span> (i + 1 &gt;= resv)
<a name="l00767"></a>00767         <span class="keywordflow">return</span> i + resv;
<a name="l00768"></a>00768     <span class="keywordflow">return</span> (i &lt;&lt; 1) + 1;
<a name="l00769"></a>00769 }
<a name="l00770"></a>00770 
<a name="l00771"></a>00771 <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> AVLLNK_P(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> d, <span class="keywordtype">size_t</span> b)
<a name="l00772"></a>00772 {
<a name="l00773"></a>00773     <span class="keywordflow">return</span> ((i &gt;&gt; d) &lt;&lt; d) + b;
<a name="l00774"></a>00774 }
<a name="l00775"></a>00775 
<a name="l00776"></a>00776 <span class="preprocessor">#define AVLLNK_UPDATE_HEIGHT(current, parent) do {  \</span>
<a name="l00777"></a>00777 <span class="preprocessor">        uintptr_t height = avllnk_height(parent);   \</span>
<a name="l00778"></a>00778 <span class="preprocessor">        if (current == parent-&gt;left) {              \</span>
<a name="l00779"></a>00779 <span class="preprocessor">            if (height == AVLLNK_LH)                \</span>
<a name="l00780"></a>00780 <span class="preprocessor">                break;                              \</span>
<a name="l00781"></a>00781 <span class="preprocessor">            else if (height == AVLLNK_BL)           \</span>
<a name="l00782"></a>00782 <span class="preprocessor">                avllnk_set_left_high(parent);       \</span>
<a name="l00783"></a>00783 <span class="preprocessor">            else                                    \</span>
<a name="l00784"></a>00784 <span class="preprocessor">                avllnk_set_balanced(parent);        \</span>
<a name="l00785"></a>00785 <span class="preprocessor">        } else {                                    \</span>
<a name="l00786"></a>00786 <span class="preprocessor">            if (height == AVLLNK_RH)                \</span>
<a name="l00787"></a>00787 <span class="preprocessor">                break;                              \</span>
<a name="l00788"></a>00788 <span class="preprocessor">            else if (height == AVLLNK_BL)           \</span>
<a name="l00789"></a>00789 <span class="preprocessor">                avllnk_set_right_high(parent);      \</span>
<a name="l00790"></a>00790 <span class="preprocessor">            else                                    \</span>
<a name="l00791"></a>00791 <span class="preprocessor">                avllnk_set_balanced(parent);        \</span>
<a name="l00792"></a>00792 <span class="preprocessor">        }                                           \</span>
<a name="l00793"></a>00793 <span class="preprocessor">        current = parent;                           \</span>
<a name="l00794"></a>00794 <span class="preprocessor">        parent = avllnk_parent(parent);             \</span>
<a name="l00795"></a>00795 <span class="preprocessor">    } while (parent)</span>
<a name="l00796"></a>00796 <span class="preprocessor"></span>
<a name="l00797"></a>00797 NV_IMPL <span class="keywordtype">void</span> __avllnk_deserialize(<a class="code" href="structavllnk__root.html" title="树根">avllnk_root</a>* root, <span class="keywordtype">char</span>** buf, 
<a name="l00798"></a>00798                                     <span class="keywordtype">size_t</span> cnt, <span class="keywordtype">size_t</span> offset)
<a name="l00799"></a>00799 {
<a name="l00800"></a>00800     <a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a> pi, pj, pp;
<a name="l00801"></a>00801     <span class="keywordtype">size_t</span> i, r, h, c, t, s, d, lv;
<a name="l00802"></a>00802     <span class="keywordflow">if</span> (!cnt) {
<a name="l00803"></a>00803         root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a> = NULL;
<a name="l00804"></a>00804         <span class="keywordflow">return</span>;
<a name="l00805"></a>00805     } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cnt == 1) {
<a name="l00806"></a>00806         pp = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)((*buf) + offset);
<a name="l00807"></a>00807         root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a> = pp;
<a name="l00808"></a>00808         pp-&gt;parent_height = AVLLNK_BL;
<a name="l00809"></a>00809         <span class="keywordflow">return</span>;
<a name="l00810"></a>00810     }
<a name="l00811"></a>00811     h = 0; c = 1; lv = 0;
<a name="l00812"></a>00812     s = 1; d = 2; t = cnt;
<a name="l00813"></a>00813     <span class="keywordflow">while</span> (t &gt;&gt;= 1) {
<a name="l00814"></a>00814         ++lv;
<a name="l00815"></a>00815         c &lt;&lt;= 1;
<a name="l00816"></a>00816     }
<a name="l00817"></a>00817     r = cnt - (--c);
<a name="l00818"></a>00818     <span class="keywordflow">while</span> (++h &lt; lv) {
<a name="l00819"></a>00819         i = s - 1;
<a name="l00820"></a>00820         s &lt;&lt;= 1;
<a name="l00821"></a>00821         <span class="keywordflow">while</span> (i &lt; c) {
<a name="l00822"></a>00822             <span class="keywordtype">size_t</span> p = AVLLNK_P(i, h + 1, s - 1);
<a name="l00823"></a>00823             pp = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)
<a name="l00824"></a>00824                 (buf[AVLLNK_F(p, r)] + offset);
<a name="l00825"></a>00825             pi = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)
<a name="l00826"></a>00826                 (buf[AVLLNK_F(i, r)] + offset);
<a name="l00827"></a>00827             pp-&gt;left = pi;
<a name="l00828"></a>00828             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga960f9f58b12e793793f259d9340926c9" title="同时设置节点的父节点和高度值">avllnk_set_parent_height</a>(pi, pp, AVLLNK_BL);
<a name="l00829"></a>00829             i += d;
<a name="l00830"></a>00830             pj = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)
<a name="l00831"></a>00831                 (buf[AVLLNK_F(i, r)] + offset);
<a name="l00832"></a>00832             pp-&gt;right = pj;
<a name="l00833"></a>00833             <a class="code" href="group__AVL_xE6_xA0_x91.html#ga960f9f58b12e793793f259d9340926c9" title="同时设置节点的父节点和高度值">avllnk_set_parent_height</a>(pj, pp, AVLLNK_BL);
<a name="l00834"></a>00834             <span class="keywordflow">if</span> (h &lt; 2) {
<a name="l00835"></a>00835                 pi-&gt;left = NULL;
<a name="l00836"></a>00836                 pi-&gt;right = NULL;
<a name="l00837"></a>00837                 pj-&gt;left = NULL;
<a name="l00838"></a>00838                 pj-&gt;right = NULL;
<a name="l00839"></a>00839             }
<a name="l00840"></a>00840             i += d;
<a name="l00841"></a>00841         }
<a name="l00842"></a>00842         d &lt;&lt;= 1;
<a name="l00843"></a>00843     }
<a name="l00844"></a>00844     root-&gt;<a class="code" href="structavllnk__root.html#a6470b4dbb19f6e6bc4cd94e01400c4ff" title="树根节点">node</a> = pp;
<a name="l00845"></a>00845     pp-&gt;parent_height = AVLLNK_BL;
<a name="l00846"></a>00846     <span class="keywordflow">for</span> (i = 0; i &lt; r; ++i) {
<a name="l00847"></a>00847         pp = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)
<a name="l00848"></a>00848             (buf[((i &gt;&gt; 1) &lt;&lt; 2) + 1] + offset);
<a name="l00849"></a>00849         pi = (<a class="code" href="group__AVL_xE6_xA0_x91.html#ga391ef925a6daa3822e079a4848543426" title="迭代器">avllnk_iter</a>)
<a name="l00850"></a>00850             (buf[i &lt;&lt; 1] + offset);
<a name="l00851"></a>00851         pi-&gt;left = NULL;
<a name="l00852"></a>00852         pi-&gt;right = NULL;
<a name="l00853"></a>00853         <span class="keywordflow">if</span> (i &amp; 1)
<a name="l00854"></a>00854             pp-&gt;right = pi;
<a name="l00855"></a>00855         <span class="keywordflow">else</span>
<a name="l00856"></a>00856             pp-&gt;left = pi;
<a name="l00857"></a>00857         <a class="code" href="group__AVL_xE6_xA0_x91.html#ga960f9f58b12e793793f259d9340926c9" title="同时设置节点的父节点和高度值">avllnk_set_parent_height</a>(pi, pp, AVLLNK_BL);
<a name="l00858"></a>00858         <span class="comment">/* 更新高度信息 */</span>
<a name="l00859"></a>00859         AVLLNK_UPDATE_HEIGHT(pi, pp);
<a name="l00860"></a>00860     }
<a name="l00861"></a>00861 }
<a name="l00862"></a>00862 
<a name="l00863"></a>00863 <span class="preprocessor">#ifdef __cplusplus</span>
<a name="l00864"></a>00864 <span class="preprocessor"></span>}
<a name="l00865"></a>00865 <span class="preprocessor">#endif  </span><span class="comment">/* #ifdef __cplusplus */</span>
</pre></div></div>
</div>
<!--- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>全部</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>数据结构</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>文件</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>函数</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>变量</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>类型定义</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>宏定义</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<hr class="footer"/><address class="footer"><small>Generated at 2015年七月16日 星期四 12:00:37 for Navo Portable Library by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
